Designing Self-Timed Devices Using the Finite Automaton Model
نویسندگان
چکیده
&YNCHRONOUS SYSTEMS offer many advantages in terms of performance and power. Designing them, however, is essentially an art (see the Designers as artists box), and the quality of the final circuit implementation depends greatly on the designer’s skill. Our research, therefore, defines a procedure that reliably accomplishes the routine work associated with designing one class of asynchronous systems, self-timed devices. We do not intend to take the designer out of the design process; rather, our procedure frees a designer to review more possibilities. Our procedure synthesizes a selftimed device with external inputs from a finite Mealy automaton specification. We chose to use that specification and a two-register structure with master-slave flipflops for two reasons:
منابع مشابه
Guest Editors' Introduction: More Practical Asynchronous Design
NEC USA Inc. IT OWES US OREAT PLEASURE to present the final three articles of our special issue on Asynchronous Circuits and Systems. Due to the large number of highquality articles received and the limited amount of space, we have published these articles serially starting with the Summer 1994 issue of IEEE Design & Test ofComputers. These last three articles focus on more theoretiabled them t...
متن کاملVerification of Complex Real-Time Systems using Rewriting Logic
This paper presents a method for model checking dense complex real-time systems. This approach is implemented at the meta level of the Rewriting Logic system Maude. The dense complex real-time system is specified using a syntax which has the semantics of timed automata and the property is specified with the temporal logic TLTL (Timed LTL). The well known timed automata model checkers Kronos and...
متن کاملControl Synthesis of Discrete Manufacturing Systems using Timed Finite Automata
An application of timed game automaton to the control synthesis of discrete manufacturing systems is presented in the paper. This approach adopts the algorithm for optimal control synthesis of timed automata proposed in [1] as a game-theoretic approach between controller and the model of the plant. KeyWords: Timed automata, control synthesis, model verification, production systems.
متن کاملRecursive Timed Automata
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real-valued variables called clocks. Recursive timed automata are finite collections of timed automata extended with special states that correspond to (potentially recursive) invocations of other timed automata from their...
متن کاملInference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership queries, each of which asks whether the language contains a certain word. There are many algorithms for learning DFAs, the most well-known being the L algorithm due to Dana Angluin. However, there are almost no extensions of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Design & Test of Computers
دوره 12 شماره
صفحات -
تاریخ انتشار 1995